Dyson's Crank of a Partition
نویسندگان
چکیده
holds. He was thus led to conjecture the existence of some other partition statistic (which he called the crank); this unknown statistic should provide a combinatorial interpretation of ^-p(lln + 6) in the same way that (1.1) and (1.2) treat the primes 5 and 7. In [4, 5], one of us was able to find a crank relative to vector partitions as follows: For a partition 7r, let #(7r) be the number of parts of ir and cr{n) be the sum of the parts of ir (or the number ir is partitioning) with the convention #() = ) = 0 for the empty partition 0, of 0. Let
منابع مشابه
Some Observations on Dyson's New Symmetries of Partitions
We utilize Dyson’s concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler’s Pentagonal Number Theorem. We streamline Dyson’s bijection relating partitions with crank ≤ k and those with k in the Rank-Set of partitions. Also, we extend Dyson’s adjoint of a partition to MacMahon’s “modular” partitions with modulus 2. This way we find a new combinato...
متن کاملRamanujan's congruences and Dyson's crank.
T he achievement of Karl Mahlburg in this issue of PNAS (1) adds a lustrous chapter to a unique mathematical object: the crank. In 1944, the crank was first hinted at by Freeman Dyson (2), then an undergraduate at Cambridge University. He had written an article, titled Some Guesses in the Theory of Partitions, for Eureka, the undergraduate mathematics journal of Cambridge. Dyson discovered the ...
متن کاملWhat is the crank of a partition?
The crank of an integer partition is an integer statistic which yields a combinatorial explanation of Ramanujan’s three famous congruences for the partition function. The existence of such a statistic was conjectured by Freeman Dyson in 1944 and realized 44 years later by George Andrews and Frank Gravan. Since then, groundbreaking work by Ken Ono, Karl Mahlburg, and others tells us that not onl...
متن کاملON THE NUMBER OF EVEN AND ODD STRINGS ALONG THE OVERPARTITIONS OF n
A partition of a non-negative integer n is a non-increasing sequence of positive integers whose sum is n. For example, The 5 partitions of 4 are 4, 3 + 1, 2 + 2, 2 + 1 + 1, and 1 + 1 + 1 + 1. To explain Ramanujan’s famous three partition congruences, the partition statistics, the rank (resp. the crank) were introduced by Dyson [8] (resp. Andrews and Garvan [3]). Atkin and Garvan [5] initiated t...
متن کاملPartitions weighted by the parity of the crank
Abstract. A partition statistic ‘crank’ gives combinatorial interpretations for Ramanujan’s famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of partitions with even crank Me(n) minus the number of partitions with odd crank Mo(n) satisfies. For example, we show that Me(5n + 4)− Mo(5n + 4) ≡ 0 (mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988